REGULAR COVERING SPACE IN DIGITAL COVERING THEORY AND ITS APPLICATIONS
نویسندگان
چکیده
منابع مشابه
Ultra regular covering space and its automorphism group
In order to classify digital spaces in terms of digital-homotopic theoretical tools, a recent paper by Han (2006b) (see also the works of Boxer and Karaca (2008) as well as Han (2007b)) established the notion of regular covering space from the viewpoint of digital covering theory and studied an automorphism group (or Deck’s discrete transformation group) of a digital covering. By using these to...
متن کاملCovering Regular Graphs
A covering projection from a graph G onto a graph H is a \local isomorphism": a mapping from the vertex set of G onto the vertex set of H such that, for every v 2 V (G), the neighborhood of v is mapped bijectively onto the neighborhood (in H) of the image of v. We investigate two concepts that concern graph covers of regular graphs. The rst one is called \multicovers": we show that for any regu...
متن کاملCovering Space Theory for Directed Topology
The state space of a machine admits the structure of time. For example, the geometric realization of a precubical set, a generalization of an unlabeled asynchronous transition system, admits a “local preorder” encoding control flow. In the case where time does not loop, the “locally preordered” state space splits into causally distinct components. The set of such components often gives a comput...
متن کاملSpace Constrained Dynamic Covering
In this paper, we identify a fundamental algorithmic problem that we term space-constrained dynamic covering (SCDC), arising in many modern-day web applications, including ad-serving and online recommendation systems in eBay and Netflix. Roughly speaking, SCDC applies two restrictions to the well-studied Max-Coverage problem [9]: Given an integer k, X = {1, 2, . . . , n} and I = {S1, . . . , Sm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Honam Mathematical Journal
سال: 2009
ISSN: 1225-293X
DOI: 10.5831/hmj.2009.31.3.279